Drivers of Globalization: An Evolutionary Perspective on Firm-State Relations in the Asian Newly Industrialized Economies

The emergence of firms from the Asian Newly Industrialized Economies (NIEs) in the global economy during the past two decades has been phenomenal. Many pundits have attributed the competitive success of these Asian NIE firms and their home economies to the relentless efforts of the so-called developmental states. They argue that state initiatives such as active industrial policy and financial support have enabled these "national champions" to venture into and compete successfully in the global economy. This statist approach to the globalization of Asian firms and their home economies, however, has unfortunately ignored the complex and dynamic evolutionary nature of firm-state relations within the changing context of economic globalization. Drawing upon an institutional and evolutionary theory of change and adjustments, I aim to explain how the global emergence of Asian firms cannot be simply read off from and explained by their embeddedness in the developmental state. Since the 1990s, these Asian firms have strategically disembedded from state apparatus and successfully reembedded themselves in dynamic global production networks. This shift of strategic partnership of Asian firms from firm-state to firm-firm networks has profound implications for our understanding of the present and future trajectories of regional economies in Asia. It presages the demise of the developmental state as the primary driver of economic change and growth in Asian economies. In developing my conceptualization of changing firm-state relations, this paper draws upon several emerging and interrelated research frontiers in economic geography that call for more theoretical attention to trans-local actors and processes, evolutionary dynamics of change, and institutional contexts.Firm-state relations, evolutionary dynamics, globalization, selection environment, global production networks

Parallel repetition for entangled k-player games via fast quantum search

We present two parallel repetition theorems for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our first theorem shows that for a $k$-player free game $G$ with entangled value $\mathrm{val}^*(G) = 1 - \epsilon$, the $n$-fold repetition of $G$ has entangled value $\mathrm{val}^*(G^{\otimes n})$ at most $(1 - \epsilon^{3/2})^{\Omega(n/sk^4)}$, where $s$ is the answer length of any player. In contrast, the best known parallel repetition theorem for the classical value of two-player free games is $\mathrm{val}(G^{\otimes n}) \leq (1 - \epsilon^2)^{\Omega(n/s)}$, due to Barak, et al. (RANDOM 2009). This suggests the possibility of a separation between the behavior of entangled and classical free games under parallel repetition. Our second theorem handles the broader class of free games $G$ where the players can output (possibly entangled) quantum states. For such games, the repeated entangled value is upper bounded by $(1 - \epsilon^2)^{\Omega(n/sk^2)}$. We also show that the dependence of the exponent on $k$ is necessary: we exhibit a $k$-player free game $G$ and $n \geq 1$ such that $\mathrm{val}^*(G^{\otimes n}) \geq \mathrm{val}^*(G)^{n/k}$. Our analysis exploits the novel connection between communication protocols and quantum parallel repetition, first explored by Chailloux and Scarpa (ICALP 2014). We demonstrate that better communication protocols yield better parallel repetition theorems: our first theorem crucially uses a quantum search protocol by Aaronson and Ambainis, which gives a quadratic speed-up for distributed search problems. Finally, our results apply to a broader class of games than were previously considered before; in particular, we obtain the first parallel repetition theorem for entangled games involving more than two players, and for games involving quantum outputs.Comment: This paper is a significantly revised version of arXiv:1411.1397, which erroneously claimed strong parallel repetition for free entangled games. Fixed author order to alphabetica

Kinetic and thermodynamic studies of some rhodium cyclam complexes.

Dept. of Chemistry and Biochemistry. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1972 .C37. Source: Dissertation Abstracts International, Volume: 62-13, Section: A. Thesis (Ph.D.)--University of Windsor (Canada), 1972

Understanding the female judoka’s “coach – athlete” relationship: a British perspective

Background and Study Aim: The initial idea for the investigation came from Maki Tsukada’s two year observation of the British system, but also after reflection on the London 2012 Olympics and the “coach – athlete” interaction. The wider impact of the study will mean that coaches will have a greater understanding of how to build and work at their relationship with their athletes and understand what the important dynamics are within. The purpose of this study was the knowledge about the “coach – athlete” relationship, to gain a greater understanding into the relationship between female judo athletes and their coach. Material and Methods: The participants chosen were the Women’s Great Britain Judo Squad 2013, the athletes (n = 36) and the National coaches (n = 2). The study explores what is felt as important, the dynamics in the relationship and does the athlete’s opinion differ from that of the coach. The athletes participated in a specifically designed questionnaire and the coaches in semi-structured interview. Results: The findings demonstrate the importance of the relationship and the varying, yet often similar attributes expressed, from both the athletes and coaches. Conclusions: The significant and fundamental finding was the importance of the “coach – athlete” relationship being recognised by both the athletes and the coaches, with the athletes declaring that they definitely need a coach to develop and improve. In a direct comparison on what is important to the athlete and to the coach in the dynamic of the relationship, the points are very similar

The Relationship of the Clinical Disc Margin and Bruch's Membrane Opening in Normal and Glaucoma Subjects.

PurposeWe tested the hypotheses that the mismatch between the clinical disc margin (CDM) and Bruch's membrane opening (BMO) is a function of BMO area (BMOA) and is affected by the presence of glaucoma.MethodsA total of 45 normal eyes (45 subjects) and 53 glaucomatous eyes (53 patients) were enrolled and underwent radial optic nerve head (ONH) imaging with spectral domain optical coherence tomography. The inner tip of the Bruch's membrane (BM) and the clinical disc margin were marked on radial scans and optic disc photographs, and were coregistered with custom software. The main outcome measure was the difference between the clinical disc area (CDA) and BMOA, or CDA-BMOA mismatch, as a function of BMOA and diagnosis. Multivariate regression analyses were used to explore the influence of glaucoma and BMOA on the mismatch.ResultsGlobal CDA was larger than BMOA in both groups but the difference was statistically significant only in the normal group (1.98 ± 0.37 vs. 1.85 ± 0.45 mm2, P = 0.02 in the normal group; 1.96 ± 0.38 vs. 1.89 ± 0.56 mm2, P = 0.08 in the glaucoma group). The sectoral CDA-BMOA mismatch was smaller in superotemporal (P = 0.04) and superonasal (P = 0.05) sectors in the glaucoma group. The normalized CDA-BMOA difference decreased with increasing BMOA in both groups (P < 0.001). Presence or severity of glaucoma did not affect the CDA-BMOA difference (P > 0.14).ConclusionsClinical disc area was larger than BMOA in normal and glaucoma eyes but reached statistical significance only in the former group. The CDA-BMOA mismatch diminished with increasing BMOA but was not affected by presence of glaucoma. These findings have important clinical implications regarding clinical evaluation of the ONH

Adaptive particle swarm optimization

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity

Cloud computing resource scheduling and a survey of its evolutionary approaches

A disruptive technology fundamentally transforming the way that computing services are delivered, cloud computing offers information and communication technology users a new dimension of convenience of resources, as services via the Internet. Because cloud provides a finite pool of virtualized on-demand resources, optimally scheduling them has become an essential and rewarding topic, where a trend of using Evolutionary Computation (EC) algorithms is emerging rapidly. Through analyzing the cloud computing architecture, this survey first presents taxonomy at two levels of scheduling cloud resources. It then paints a landscape of the scheduling problem and solutions. According to the taxonomy, a comprehensive survey of state-of-the-art approaches is presented systematically. Looking forward, challenges and potential future research directions are investigated and invited, including real-time scheduling, adaptive dynamic scheduling, large-scale scheduling, multiobjective scheduling, and distributed and parallel scheduling. At the dawn of Industry 4.0, cloud computing scheduling for cyber-physical integration with the presence of big data is also discussed. Research in this area is only in its infancy, but with the rapid fusion of information and data technology, more exciting and agenda-setting topics are likely to emerge on the horizon